321-Polygon-Avoiding Permutations and Chebyshev Polynomials
نویسندگان
چکیده
A 321-k-gon-avoiding permutation π avoids 321 and the following four patterns: k(k + 2)(k + 3) · · · (2k − 1)1(2k)23 · · · (k − 1)(k + 1), k(k + 2)(k + 3) · · · (2k − 1)(2k)12 · · · (k − 1)(k + 1), (k + 1)(k + 2)(k + 3) · · · (2k − 1)1(2k)23 · · · k, (k + 1)(k + 2)(k + 3) · · · (2k − 1)(2k)123 · · · k. The 321-4-gon-avoiding permutations were introduced and studied by Billey and Warrington [BW] as a class of elements of the symmetric group whose KazhdanLusztig, Poincaré polynomials, and the singular loci of whose Schubert varieties have fairly simple formulas and descriptions. Stankova and West [SW1] gave an exact enumeration in terms of linear recurrences with constant coefficients for the cases k = 2, 3, 4. In this paper, we extend these results by finding an explicit expression for the generating function for the number of 321-k-gon-avoiding permutations on n letters. The generating function is expressed via Chebyshev polynomials of the second kind.
منابع مشابه
Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
Several authors have examined connections among 132-avoiding permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we find analogues for some of these results for permutations π avoiding 132 and 1223 (there is no occurrence πi < πj < πj+1 such that 1 ≤ i ≤ j − 2) and provide a combinatorial interpretation for such permutations in terms of lattice paths. ...
متن کاملInversion polynomials for 321-avoiding permutations
We prove a generalization of a conjecture of Dokos, Dwyer, Johnson, Sagan, and Selsor giving a recursion for the inversion polynomial of 321-avoiding permutations. We also answer a question they posed about finding a recursive formulas for the major index polynomial of 321-avoiding permutations. Other properties of these polynomials are investigated as well. Our tools include Dyck and 2-Motzkin...
متن کاملRESTRICTED 132-AVOIDING k-ARY WORDS, CHEBYSHEV POLYNOMIALS, AND CONTINUED FRACTIONS
We study generating functions for the number of n-long k-ary words that avoid both 132 and an arbitrary `-ary pattern. In several interesting cases the generating function depends only on ` and is expressed via Chebyshev polynomials of the second kind and continued fractions. 1. Extended abstract 1.1. Permutations. Let Sn denote the set of permutations of [n] = {1, 2, . . . , n}, written in one...
متن کاملInversion polynomials for 321-avoiding permutations: addendum
This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, we consider symmetry, unimodality, behavior modulo 2, and signed enumeration.
متن کاملRestricted even permutations and Chebyshev polynomials
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره on شماره
صفحات -
تاریخ انتشار 2002